Search results for "Open problem"
showing 10 items of 37 documents
Visible parts of fractal percolation
2009
We study dimensional properties of visible parts of fractal percolation in the plane. Provided that the dimension of the fractal percolation is at least 1, we show that, conditioned on non-extinction, almost surely all visible parts from lines are 1-dimensional. Furthermore, almost all of them have positive and finite Hausdorff measure. We also verify analogous results for visible parts from points. These results are motivated by an open problem on the dimensions of visible parts.
Some problems in number theory that arise from group theory
2021
In this expository paper, we present several open problems in number theory that have arisen while doing research in group theory. These problems are on arithmetical functions or partitions. Solving some of these problems would allow to solve some open problem in group theory.
On Conditioning Operators
1999
The construction of conditional events (so-called measure-free conditioning) has a long history and is one of the fundamental problems in non-deterministic system theory (cf. [6]). In particular, the iteration of measure-free conditioning is still an open problem. The present paper tries to make a contribution to this question. In particular, we give an axiomatic introduction of conditioning operators which act as binary operations on the universe of events. The corresponding axiom system of this type of operators focus special attention on the intuitive understanding that the event ‘α given β’ is somewhere in “between” ‘α and β’ and ‘β implies α’. A detailed motivation of these axioms can …
A New Framework for the Extraction of Contour Lines in Scanned Topographic Maps
2010
3D simulations requested in various applications had led to the development of fast and accurate terrain topography measurement techniques. In this paper, we are presenting a novel framework dedicated to the semiautomatic processing of scanned maps, extracting the contour lines vectors and building a digital elevation model on their basis, fulfilled by a number of stages discussed in detail throughout the work. Despite the good results obtained on a large amount of scanned maps, a completely automatic map processing technique is unrealistic and remains an open problem.
Efficient lower and upper bounds of the diagonal-flip distance between triangulations
2006
There remains today an open problem whether the rotation distance between binary trees or equivalently the diagonal-flip distance between triangulations can be computed in polynomial time. We present an efficient algorithm for computing lower and upper bounds of this distance between a pair of triangulations.
On the Second Order Rational Difference Equation $$x_{n+1}=\beta +\frac{1}{x_n x_{n-1}}$$ x n + 1 = β + 1 x n x n - 1
2016
The author investigates the local and global stability character, the periodic nature, and the boundedness of solutions of the second-order rational difference equation $$x_{n+1}=\beta +\frac{1}{x_{n}x_{n-1}}, \quad n=0,1,\ldots ,$$ with parameter \(\beta \) and with arbitrary initial conditions such that the denominator is always positive. The main goal of the paper is to confirm Conjecture 8.1 and to solve Open Problem 8.2 stated by A.M. Amleh, E. Camouzis and G. Ladas in On the Dynamics of a Rational Difference Equations I (International Journal of Difference Equations, Volume 3, Number 1, 2008, pp.1–35).
Almost Tight Bound for the Union of Fat Tetrahedra in Three Dimensions
2007
For any AND-OR formula of size N, there exists a bounded-error N1/2+o(1)-time quantum algorithm, based on a discrete-time quantum walk, that evaluates this formula on a black-box input. Balanced, or "approximately balanced," formulas can be evaluated in O(radicN) queries, which is optimal. It follows that the (2-o(1))th power of the quantum query complexity is a lower bound on the formula size, almost solving in the positive an open problem posed by Laplante, Lee and Szegedy.
Periodic Solutions of the Second Order Quadratic Rational Difference Equation $$x_{n+1}=\frac{\alpha }{(1+x_n)x_{n-1}} $$ x n + 1 = α ( 1 + x n ) x n…
2016
The aim of this article is to investigate the periodic nature of solutions of a rational difference equation $$x_{n+1}=\frac{\alpha }{(1+x_n)x_{n-1}}. {(*)} $$ We explore Open Problem 3.3 given in Amleh et al. (Int J Differ Equ 3(1):1–35, 2008, [2]) that requires to determine all periodic solutions of the equation (*). We conclude that for the equation (*) there are no periodic solution with prime period 3 and 4. Period 7 is first period for which exists nonnegative parameter \(\alpha \) and nonnegative initial conditions.
Stochastic dynamics of nonlinear systems with a fractional power-law nonlinear term: The fractional calculus approach
2011
Fractional power-law nonlinear drift arises in many applications of engineering interest, as in structures with nonlinear fluid viscous–elastic dampers. The probabilistic characterization of such structures under external Gaussian white noise excitation is still an open problem. This paper addresses the solution of such a nonlinear system providing the equation governing the evolution of the characteristic function, which involves the Riesz fractional operator. An efficient numerical procedure to handle the problem is also proposed.
Combinatorial aspects of L-convex polyominoes
2007
We consider the class of L-convex polyominoes, i.e. those polyominoes in which any two cells can be connected with an ''L'' shaped path in one of its four cyclic orientations. The paper proves bijectively that the number f"n of L-convex polyominoes with perimeter 2(n+2) satisfies the linear recurrence relation f"n"+"2=4f"n"+"1-2f"n, by first establishing a recurrence of the same form for the cardinality of the ''2-compositions'' of a natural number n, a simple generalization of the ordinary compositions of n. Then, such 2-compositions are studied and bijectively related to certain words of a regular language over four letters which is in turn bijectively related to L-convex polyominoes. In …